Exploring Naccache-Stern Knapsack Encryption
نویسندگان
چکیده
The Naccache–Stern public-key cryptosystem (NS) relies on the conjectured hardness of the modular multiplicative knapsack problem: Given p, {vi}, ∏ vi i mod p, find the {mi}. Given this scheme’s algebraic structure it is interesting to systematically explore its variants and generalizations. In particular it might be useful to enhance NS with features such as semantic security, re-randomizability or an extension to higher-residues. This paper addresses these questions and proposes several such variants.
منابع مشابه
Linear Bandwidth Naccache-Stern Encryption
The Naccache-Stern (ns) knapsack cryptosystem is an original yet little-known public-key encryption scheme. In this scheme, the ciphertext is obtained by multiplying public-keys indexed by the message bits modulo a prime p. The cleartext is recovered by factoring the ciphertext raised to a secret power modulo p. ns encryption requires a multiplication per two plaintext bits on the average. Decr...
متن کاملA secure approach to election scheme based on Naccache Stern Knapsack Cryptosystem
Election is a fundamental mechanism of democracy for people to elect a Government of their choice. Electronic voting is an emerging technology that guarantees privacy, security, correctness, verifiability and robustness. Recently, many researchers have proposed the improvements of efficient schemes on the electronic voting to ensure the security and privacy of voters. However, there is no schem...
متن کاملA general construction for monoid-based knapsack protocols
We present a generalized version of the knapsack protocol proposed by D. Naccache and J. Stern at the Proceedings of Eurocrypt (1997). Our new framework will allow the construction of other knapsack protocols having similar security features. We will outline a very concrete example of a new protocol using extension fields of a finite field of small characteristic instead of the prime field Z/pZ...
متن کاملIndex Calculation Attacks on RSA Signature and Encryption
At Crypto ’85, Desmedt and Odlyzko described a chosen-ciphertext attack against plain RSA encryption. The technique can also be applied to RSA signatures and enables an existential forgery under a chosen-message attack. The potential of this attack remained untapped until a twitch in the technique made it effective against two very popular RSA signature standards, namely iso/iec 9796-1 and iso/...
متن کاملGroup Authentication Using The Naccache-Stern Public-Key Cryptosystem
A group authentication protocol authenticates pre-defined groups of individuals such that: • No individual is identified • No knowledge of which groups can be successfully authenticated is known to the verifier • No sensitive data is exposed The paper presents a group authentication protocol based on splitting the private keys of the Naccache-Stern public-key cryptosystem in such a way that the...
متن کامل